#include <bits/stdc++.h>
using namespace std;
typedef long double ld;
typedef long long lli;
typedef pair<lli,lli> pii;
typedef vector<lli> vi;
#define endl "\n"
#define fi first
#define si second
#define pb push_back
#define sz(s) lli(s.size())
#define all(s) begin(s), end(s)
#define print(s) cout<<s<<endl
#define fore(i,a,b) for(lli i = (a), TT=(b); i<TT; ++i)
#define _ ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
//---------------------------------
//---------------------------------
const lli MOD = 1e9+7;
//---------------------------------
lli mcd(lli a, lli b) {return b ? mcd(b, a%b) : a;}
lli pos, neg;
lli x, n, a, b;
set<pii> answ;
int main(){_
cin>>x;
fore(i,0,x){
char aux;
cin>>aux;
if(aux=='+') pos++;
else neg++;
}
while(pos > 0 && neg > 0){
lli aux = mcd(pos,neg);
answ.insert({max(pos, neg)/aux, min(pos,neg)/aux});
pos--;
neg--;
}
cin>>n;
while(n--){
cin>>a>>b;
lli aux = mcd(a,b);
if( answ.count({max(a,b)/aux, min(a,b)/aux}) || answ.count({1,1}))
print("YES");
else print("NO");
}
return 0;
}
1598B - Groups | 1602B - Divine Array |
1594B - Special Numbers | 1614A - Divan and a Store |
2085. Count Common Words With One Occurrence | 2089. Find Target Indices After Sorting Array |
2090. K Radius Subarray Averages | 2091. Removing Minimum and Maximum From Array |
6. Zigzag Conversion | 1612B - Special Permutation |
1481. Least Number of Unique Integers after K Removals | 1035. Uncrossed Lines |
328. Odd Even Linked List | 1219. Path with Maximum Gold |
1268. Search Suggestions System | 841. Keys and Rooms |
152. Maximum Product Subarray | 337. House Robber III |
869. Reordered Power of 2 | 1593C - Save More Mice |
1217. Minimum Cost to Move Chips to The Same Position | 347. Top K Frequent Elements |
1503. Last Moment Before All Ants Fall Out of a Plank | 430. Flatten a Multilevel Doubly Linked List |
1290. Convert Binary Number in a Linked List to Integer | 1525. Number of Good Ways to Split a String |
72. Edit Distance | 563. Binary Tree Tilt |
1306. Jump Game III | 236. Lowest Common Ancestor of a Binary Tree |